If I keep randomly selecting problems from chapter 2, I’m going to rapidly run out of link-based puns. This week I timebox my solution to an hour.

I love testing. No joke. So this week was a fun one for me and in case you’re wondering the title is in fact a Hackers reference!

For this week, Problem 6.1 is a classic logic puzzle that fits the bill of needing something that consumes little time.

Problem 2.1 is a gentle re-introduction to Linked Lists. Marvel as we reduce the complexity of \(\pi\) by removing pesky duplicate digits!

This week I tackle the randomly selected first problem from the final chapter of the book and take a first stab at binary arithmetic!

Problem 1.1 asks to determine if a string is comprised of all unique characters, and I work to calibrate the finer details of this challenge.

Re-establishing the problem-solving habit that I used back when I was working my way through CLRS. My goals and needs have changed in the years since then, so I have some thoughts on how to productively go about this.